Multi-label cooperative cuts
نویسندگان
چکیده
Recently, a family of global, non-submodular energy functions has been proposed that is expressed as coupling edges in a graph cut. This formulation provides a rich modelling framework and also leads to efficient approximate inference algorithms. So far, the results addressed binary random variables. Here, we extend these results to the multi-label case, and combine edge coupling with move-making algorithms.
منابع مشابه
Combinatorial problems with submodular coupling in machine learning and computer vision
Numerous problems in machine learning and computer vision are discrete. As a complicating factor, they often involve large data sets and higher-order interactions between elements in the data. For example, segmenting an image into foreground and background requires assigning a label to each pixel in the image. As object and background commonly have significant wide-range coherency, the most pro...
متن کاملExploiting Associations between Class Labels in Multi-label Classification
Multi-label classification has many applications in the text categorization, biology and medical diagnosis, in which multiple class labels can be assigned to each training instance simultaneously. As it is often the case that there are relationships between the labels, extracting the existing relationships between the labels and taking advantage of them during the training or prediction phases ...
متن کاملMLIFT: Enhancing Multi-label Classifier with Ensemble Feature Selection
Multi-label classification has gained significant attention during recent years, due to the increasing number of modern applications associated with multi-label data. Despite its short life, different approaches have been presented to solve the task of multi-label classification. LIFT is a multi-label classifier which utilizes a new strategy to multi-label learning by leveraging label-specific ...
متن کاملHuman limb segmentation in depth maps based on spatio-temporal Graph-cuts optimization
We present a framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs. First, from a set of random depth features, Random Forest is used to infer a set of label probabilities for each data sample. This vector of probabilities is used as unary term in α − β swap Graph-cuts algorithm. Moreover, depth values of...
متن کاملMulti-label MRF Optimization via a Least Squares s - t Cut
We approximate the k-label Markov random field optimization by a single binary (s−t) graph cut. Each vertex in the original graph is replaced by only ceil(log2(k)) new vertices and the new edge weights are obtained via a novel least squares solution approximating the original data and label interaction penalties. The s− t cut produces a binary “Gray” encoding that is unambiguously decoded into ...
متن کامل